The problem of determining in advance whether a particular

program or algorithm will terminate or run forever. The

halting problem is the canonical example of a provablyunsolvable problem. Obviously any attempt to answer the

question by actually executing the algorithm or simulating

each step of its execution will only give an answer if the

algorithm under consideration does terminate, otherwise the

algorithm attempting to answer the question will itself run

forever.